Amortized Heap-Space Analysis for First-Order Functional Programs
نویسنده
چکیده
This work addresses the problem of controlled heap usage by functional programs. Heap consumption becomes an issue in many applications; examples include programming for small devices and distributed computing. We consider a heap-aware type system for a functional language over polymorphic lists. The type annotations in the system determine bounds on heap consumption and gain as functions of the size of data. The system extends the amortization-based procedure developed by Hofmann and Jost for linear bounds. We believe that the results, which we have obtained for the functional language,may be adopted for an object-oriented setting, provided that classes assume algebraic data type interface.
منابع مشابه
Amortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bounds for Functional Programs (Extended Version)
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. This analysis has been successfully applied to many standard algorithms but is limited to bounds that are linear in the size of the input. Here we extend this system to polynomial resource bounds. An automatic amortiz...
متن کاملAmortized Resource Analysis with Polynomial Potential A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. This analysis has been successfully applied to many standard algorithms but is limited to bounds that are linear in the size of the input. Here we extend this system to polynomial resource bounds. An automatic amortiz...
متن کاملChapter 1 AHA : A mortized H eap Space Usage A nalysis – Project Paper –
This paper introduces AHA, an NWO-funded2 344K Euro project involving research into an amortized analysis of heap-space usage by functional and imperative programs. Amortized analysis is a promising technique that can improve on simply summing worst case bounds. The project seeks to combine this technique with type theory in order to obtain non-linear bounds on heap-space usage for functional l...
متن کاملAHA: Amortized Heap Space Usage Analysis
This paper introduces AHA, an NWO-funded1 344K Euro research project involving research into an amortized analysis of heap-space usage by functional and imperative programs. Amortized analysis is a promising technique that can significantly improve on simply summing worst case bounds. The project seeks to apply this technique to obtain non-linear bounds on heap-space usage for lazy functional l...
متن کاملAmortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potentialbased amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. This analysis has been successfully applied to many standard algorithms but is limited to bounds that are linear in the length of the input. Here we extend this system to polynomial resource bounds. An automatic amorti...
متن کامل